Modelling multistage information spreading in dynamic complex networks
نویسندگان
چکیده
منابع مشابه
Information Spreading in Dynamic Networks
We study the fundamental problem of information spreading (also known as gossip) in dynamic networks. In gossip, or more generally, k-gossip, there are k pieces of information (or tokens) that are initially present in some nodes and the problem is to disseminate the k tokens to all nodes. The goal is to accomplish the task in as few rounds of distributed computation as possible. The problem is ...
متن کاملInformation spreading on dynamic social networks
Nowadays, information spreading on social networks has triggered an explosive attention in various disciplines. Most of previous works in this area mainly focus on discussing the effects of spreading probability or immunization strategy on static networks. However, in real systems, the peer-to-peer network structure changes constantly according to frequently social activities of users. In order...
متن کاملModeling Information Spreading on Complex Networks
INTRODUCTION The investigation of social spreading phenomena such as propagation of rumors, the diffusion of fads, the adoption of technological innovations and the success of consumer products mediated by word-of-mouth, has a long tradition in sociology and economics. It has been postulated [1, 2] that the network of contacts between individuals affects the spreading process, and recently, wit...
متن کاملInformation Spreading in Dynamic Networks Under Oblivious Adversaries
We study the problem of all-to-all information exchange, also known as gossip, in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always connected. In the gossip problem, there are n tokens arbitrarily distributed among the n network nodes, and the goal is to disseminate all the n tokens to every node. O...
متن کاملInformation Spreading in Dynamic Networks: An Analytical Approach
Sensor networks is one of the most relevant concrete examples of dynamic networks. Their dynamic behaviour is mainly due to the presence of node/link faults and node mobility. The aim of this chapter is to survey a new approach to study such dynamic networks, recently introduced in [15–19]. The major novelty of this approach relies on two basic issues. 1. The dynamic network is modeled as an ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2017
ISSN: 1877-0509
DOI: 10.1016/j.procs.2017.11.197